Time/Space Trade-Offs for Reversible Computation
نویسنده
چکیده
A reversible Turing machine is one whose transition function is 1, so that no instantaneous description (ID) has more than one predecessor. Using a pebbling argument, this paper shows that, for any e > 0, ordinary multitape Turing machines using time T and space S can be simulated by reversible ones using time O(T +) and space O(S log T) or in linear time and space O(ST). The former result implies in particular that reversible machines can simulate ordinary ones in quadratic space. These results refer to reversible machines that save their input, thereby insuring a global 1:1 relation between initial and final Ds, even when the function being computed is many-to-one. Reversible machines that instead erase their input can of course compute only 1:1 partial recursive functions and indeed provide a G6del numbering of such functions. The time/space cost of computing a 1:1 function on such a machine is equal within a small polynomial to the cost of computing the function and its inverse on an ordinary Turing machine.
منابع مشابه
A one-model approach for Computation of congestion With productions trade-offs and weight restrictions
متن کامل
Ethical Perspective: Five Unacceptable Trade-offs on the Path to Universal Health Coverage
This article discusses what ethicists have called “unacceptable trade-offs” in health policy choices related to universal health coverage (UHC). Since the fiscal space is constrained, trade-offs need to be made. But some trade-offs are unacceptable on the path to universal coverage. Unacceptable choices include, among other examples from low-income countries, to expand coverage for services wit...
متن کاملReversibility and Adiabatic Computation: Trading Time and Space for Energy
Future miniaturization and mobilization of computing devices requires energy parsimonious ‘adiabatic’ computation. This is contingent on logical reversibility of computation. An example is the idea of quantum computations which are reversible except for the irreversible observation steps. We propose to study quantitatively the exchange of computational resources like time and space for irrevers...
متن کاملTime-Space Trade-Offs in Parallel and Neural Computing
To which extend can we speak about time-space tradeoffs in the sense that, for a given problem, a faster algorithm requires more space than a slower algorithm? Furthermore, to which extend can we speak about such trade-offs in the context of parallel or neural computing? This paper aims to give an insight to these problems. The parallel computation thesis, first proposed in print in [Ch.S.76], ...
متن کاملStream ciphers and the eSTREAM project
Stream ciphers are an important class of symmetric cryptographic algorithms. The eSTREAM project contributed significantly to the recent increase of activity in this field. In this paper, we present a survey of the eSTREAM project. We also review recent time/memory/data and time/memory/key trade-offs relevant for the generic attacks on stream ciphers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 18 شماره
صفحات -
تاریخ انتشار 1989